Pipe Routing Design for Aero-Engine Using Monte Carlo Tree Search Method
نویسندگان
چکیده
Abstract Pipe routing design (PRD) is a complex process that involves large search space and requires experienced professionals. Despite advancements in aero-engine design, PRD remains stage not completely automated. In this article, we present new approach to by formulating it as Markov decision proposing pipe method based on Monte Carlo Tree Search (PRD-MCTS). Firstly, paper uses an intelligent algorithm look for enough paths each pair of joints. Secondly, PRD-MCTS regards path candidate choice, then randomly chooses calculates the probability collision-free until set time. The selects with highest updates environment next selection. A simplified from aero engine verifies correctness methods.
منابع مشابه
MDTS: automatic complex materials design using Monte Carlo tree search
Complex materials design is often represented as a black-box combinatorial optimization problem. In this paper, we present a novel python library called MDTS (Materials Design using Tree Search). Our algorithm employs a Monte Carlo tree search approach, which has shown exceptional performance in computer Go game. Unlike evolutionary algorithms that require user intervention to set parameters ap...
متن کاملMonte-Carlo Tree Search
representation of the game. It was programmed in LISP. Further use of abstraction was also studied by Friedenbach (1980). The combination of search, heuristics, and expert systems led to the best programs in the eighties. At the end of the eighties a new type of Go programs emerged. These programs made an intensive use of pattern recognition. This approach was discussed in detail by Boon (1990)...
متن کاملA New Method for Parallel Monte Carlo Tree Search
In recent years there has been much interest in the Monte Carlo tree search algorithm, a new, adaptive, randomized optimization algorithm. In fields as diverse as Artificial Intelligence, Operations Research, and High Energy Physics, research has established that Monte Carlo tree search can find good solutions without domain dependent heuristics. However, practice shows that reaching high perfo...
متن کاملEfficient Sampling Method for Monte Carlo Tree Search Problem
We consider Monte Carlo tree search problem, a variant of Min-Max tree search problem where the score of each leaf is the expectation of some Bernoulli variables and not explicitly given but can be estimated through (random) playouts. The goal of this problem is, given a game tree and an oracle that returns an outcome of a playout, to find a child node of the root which attains an approximate m...
متن کاملParallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the strength of any Go program. In this article, we discuss three parallelization methods for MCTS: leaf parallelization, root parallelization, and tree parallelization. To be effective tree parallelization requires two techni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of physics
سال: 2023
ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']
DOI: https://doi.org/10.1088/1742-6596/2569/1/012017